package Other.alibaba;

import java.util.Scanner;

/**
 * @Classname LongestIncreSubsequence
 * @Description TODO
 * @Date 2021/6/26 10:59
 * @Created by ASUS
 *
 * 小强现在有n个物品,每个物品有两种属性x和y.他想要从中挑出尽可能多的物品满足以下条件:对于任意两个物品
 * x_1<x_2 && y_1<y_2  or x_1>x_2 && y_1>y_2
 * 问最多能挑出多少物品.
 */
public class LongestIncreSubsequence {
    static class Node {
        int x;
        int y;
    }
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int data_num = Integer.parseInt(scanner.nextLine());
        for (int i = 0; i < data_num; i++) {
            int n = Integer.parseInt(scanner.nextLine());
            for (int j = 0; j < n; j++) {

            }
        }
    }
}
